A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
نویسندگان
چکیده
This paper provides the convex hull description for the following basic operating constraints of a single power generation unit in Unit Commitment (UC) problems: 1) generation limits, 2) startup and shutdown capabilities, and 3) minimum up and down times. Although the model does not consider some crucial constraints, such as ramping, the proposed constraints can be used as the core of any UC formulation, thus tightening the final UC model. We provide evidence that dramatic improvements in computational time are obtained by solving a self-UC problem for different case studies.
منابع مشابه
The Ramping Polytope and Cut Generation for the Unit Commitment Problem
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp up/down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to pres...
متن کاملConstrained Minkowski Sums of Polyhedra with an Application in Unit Commitment
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramping constraints, time-dependent start-up costs, and start-up/shut-down ramping. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to present ...
متن کاملGenerating Cuts from the Ramping Polytope for the Unit Commitment Problem
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramping constraints, time-dependent start-up costs, and start-up/shut-down ramping. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to present ...
متن کاملA New Hybrid Heuristic Technique for Unit Commitment and Generation Scheduling
This paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. A modified objective function associated with a new start-up cost term is introduced in this paper. The proposed method is used to solve generating scheduling problem satisfying SRR, minimum up and down time as well as ramp rate constraints. Two case studies are conducted to imp...
متن کاملTight MIP formulations for bounded up/down times and interval-dependent start-ups
Switching machines on and off is an important aspect of unit commitment problems and production planning problems, among others. Here we study tight mixed integer programming formulations for two aspects of such problems: bounded length onand off-intervals, and interval-dependent start-ups. For the problem with both these aspects we develop a tight (convex hull) formulation involving additional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURO J. Computational Optimization
دوره 5 شماره
صفحات -
تاریخ انتشار 2017